Postprocessing for speeding up general quantum search algorithms
نویسندگان
چکیده
منابع مشابه
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching o...
متن کاملSpeeding Up the Search for Optimal Partitions
Numerical value range partitioning is an inherent part of inductive learning. In classification problems, a common partition ranking method is to use an attribute evaluation function to assign a goodness score to each candidate. Optimal cut point selection constitutes a potential efficiency bottleneck, which is often circumvented by using heuristic methods. This paper aims at improving the effi...
متن کاملSpeeding up correlation search for binary data
Finding the most interesting correlations in a collection of items is essential for problems in many commercial, medical, and scientific domains. Much previous research focuses on finding correlated pairs instead of correlated itemsets in which all items are correlated with each other. Though some existing methods find correlated itemsets of any size, they suffer from both efficiency and effect...
متن کاملAn effective Procedure for Speeding up Algorithms
The provably asymptotically fastest algorithm within a factor of 5 for formally described problems will be constructed. The main idea is to enumerate all programs provably equivalent to the original problem by enumerating all proofs. The algorithm could be interpreted as a generalization and improvement of Levin search, which is, within a multiplicative constant, the fastest algorithm for inver...
متن کاملSpeeding Up Shortest Path Algorithms
Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time O(mn + m lg n + nTψ(m , n)), where m is the number of different edges contained in shortest paths and Tψ(m , n) is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial n time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2015
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.92.022353